
@Article{FRESCHAP97,
  author =	 {Yoav Freund and Robert E. Schapire},
  title =	 {A decision-theoretic generalization of on-line
                  learning and an application to boosting},
  journal =	 {Journal of Computer and System Sciences},
  year =	 {1997},
  volume =	 {55},
  number =	 {1},
  pages =	 {119--139},
}

@Article{FRESCHAP99,
  author =	 {Yoav Freund and Robert E. Schapire},
  title =	 {A short introduction to Boosting},
  journal =	 {Journal of Japanese Society for Artificial
                  Intelligence},
  year =	 {1999},
  volume =	 {14},
  number =	 {5},
  pages =	 {771--780},
}

@Article{FREUND95,
  author =	 {Yoav Freund},
  title =	 {Boosting a weak learning algorithm by majority},
  journal =	 {Information and Computation},
  year =	 {1995},
  volume =	 {121},
  number =	 {2},
  pages =	 {256--285},
}

@Article{HAUSSLER91,
  author =	 {D. Haussler and M. Kearns and N. Littlestone and
                  M. K. Warmuth},
  title =	 {Equivalence of models for polynomial learnability},
  journal =	 {Information and Computing},
  year =	 {1991},
  volume =	 {95},
  number =	 {2},
  pages =	 {129--161},
}

@TechReport{KEARNS88,
  author =	 {M. J. Kearns and L. G. Valiant},
  title =	 {Learning boolean formulae or finite automata is as
                  hard as factoring},
  institution =	 {Harvard University, Aiken Computation Laboratory},
  year =	 {1988},
  number =	 {TR-14-88},
  address =	 {Cambridge, MA},
}

@InProceedings{KEARNS89,
  author =	 {M. J. Kearns and L. G. Valiant},
  title =	 {Cryptographic limitations on learning booleans
                  formulae and finite automata},
  booktitle =	 {Proceedings of the Twenty-First Annual ACM Symposium
                  on Theory of Computing},
  pages =	 {433--444},
  year =	 {1989},
  address =	 {New York, NY},
  publisher =	 {ACM Press},
}

@Article{KEARNS94,
  author =	 {M. J. Kearns and L. G. Valiant},
  title =	 {Cryptographic limitations on learning boolean
                  formulae and finite automata},
  journal =	 {Journal of the ACM},
  year =	 {1994},
  volume =	 {41},
  number =	 {1},
  pages =	 {67--95},
}

@Book{MICHAEL94,
  author =	 {Michael J. Kearns and Umesh V. Vazirani},
  title =	 {An introduction to computational learning theory},
  publisher =	 {MIT Press},
  year =	 {1994},
}

@Book{MITCHEL,
  author =	 {Tom Mitchel},
  title =	 {Learning theory},
  publisher =	 {McGraw-Hill},
  year =	 {1997},
}

@Article{SCHAPIRE90,
  author =	 {Robert E. Schapire},
  title =	 {The strength of weak learnability},
  journal =	 {Machine Learning},
  year =	 {1990},
  volume =	 {5},
  number =	 {2},
  pages =	 {197--227},
}

@InProceedings{SCHAPIRE99ab,
  author =	 {Robert E. Schapire},
  title =	 {Theoretical views of Boosting and apllications},
  booktitle =	 {Proceeding Algorithmic Learning Theory},
  pages =	 {????},
  year =	 {1999},
  address =	 {????},
  publisher =	 {????},
}

@Article{SCHAPSING99,
  author =	 {Robert E. Schapire and Yoran Singer},
  title =	 {Improved boosting algorithms using confidence-rated
                  predictions},
  journal =	 {Machine Learning},
  year =	 {1999},
  volume =	 {37},
  number =	 {3},
  pages =	 {297--336},
}

@Article{VALIANT84,
  author =	 {L. G. Valiant},
  title =	 {A theory of learnable},
  journal =	 {Communications of the ACM },
  year =	 {1984},
  volume =	 {27},
  pages =	 {1134-1142},
}

